runtime.timer.when (field)

31 uses

	runtime (current package)
		time.go#L29: 	when   int64
		time.go#L261: 	if t.when <= 0 {
		time.go#L272: 	when := t.when
		time.go#L305: 		pp.timer0When.Store(t.when)
		time.go#L505: 		t.when = when
		time.go#L524: 		if when < t.when {
		time.go#L596: 			t.when = t.nextwhen
		time.go#L633: 				t.when = t.nextwhen
		time.go#L707: 				t.when = t.nextwhen
		time.go#L782: 			if t.when > now {
		time.go#L784: 				return t.when
		time.go#L812: 			t.when = t.nextwhen
		time.go#L856: 		delta := t.when - now
		time.go#L857: 		t.when += t.period * (1 + -delta/t.period)
		time.go#L858: 		if t.when < 0 { // check for overflow.
		time.go#L859: 			t.when = maxWhen
		time.go#L926: 					t.when = t.nextwhen
		time.go#L992: 		if t.when < pp.timers[p].when {
		time.go#L993: 			print("bad timer heap at ", i, ": ", p, ": ", pp.timers[p].when, ", ", i, ": ", t.when, "\n")
		time.go#L1009: 		pp.timer0When.Store(pp.timers[0].when)
		time.go#L1074: 	when := t[i].when
		time.go#L1081: 		if when >= t[p].when {
		time.go#L1100: 	when := t[i].when
		time.go#L1111: 		w := t[c].when
		time.go#L1112: 		if c+1 < n && t[c+1].when < w {
		time.go#L1113: 			w = t[c+1].when
		time.go#L1117: 			w3 := t[c3].when
		time.go#L1118: 			if c3+1 < n && t[c3+1].when < w3 {
		time.go#L1119: 				w3 = t[c3+1].when